The Number of Transects Required to Compute a Robust PHABSIM Habitat Index

On the number of multiplications required to compute certain functions.

from linguistics to literature: a linguistic approach to the study of linguistic deviations in the turkish divan of shahriar

chapter i provides an overview of structural linguistics and touches upon the saussurean dichotomies with the final goal of exploring their relevance to the stylistic studies of literature. to provide evidence for the singificance of the study, chapter ii deals with the controversial issue of linguistics and literature, and presents opposing views which, at the same time, have been central to t...

A new approach to compute acyclic chromatic index of certain chemical structures

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph $G$ denoted by $chi_a '(G)$ is the minimum number $k$ such that there is an acyclic edge coloring using $k$ colors. The maximum degree in $G$ denoted by $Delta(G)$, is the lower bound for $chi_a '(G)$. $P$-cuts introduced in this paper acts as a powerfu...

On the Minimum Number of Additions Required to Compute a Quadratic Form

Let &(x,, . . . xn) = C, ci<iGn~i~i. Vari has proved that (n 1) multiplications are necessary to compute S,,, but the minimum number of additions required to compute S, was left as an open problem in [ 1, p. 4981. We show that (2n 4) additions are necessary to compute S,, which would settle the problem. For the evaluation of the quadratic form we consider normal evaluation schemes in which all ...

The relationship between the distinguishing number and the distinguishing index with detection number of a graph

This article has no abstract.